翻訳と辞書 Words near each other ・ K-type asteroid ・ K-type main-sequence star ・ K-UTE ・ K-value ・ K-Variegated graph ・ K-vector ・ K-Verband ・ K-vertex-connected graph ・ K-Ville ・ K-Ville (TV series) ・ K-W Line ・ K-W United FC ・ K-W United FC (W-League) ・ K-Wagen ・ K-water ・ K-Way Merge Algorithms ・ K-X-P ・ K-Y Jelly ・ K-Z ・ K. (novel) ・ K. 453a ・ K. A. A. Gurusamy ・ K. A. Abraham ・ K. A. Applegate ・ K. A. Bedford ・ K. A. C. Creswell ・ K. A. Francis ・ K. A. Gamage ・ K. A. Isaac ・ K. A. Jayapal Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク K-Way Merge Algorithms ： ウィキペディア英語版 K-Way Merge Algorithms In computer science, K-Way Merge Algorithms are a specific type of Sequence Merge Algorithms that specialize in taking in multiple sorted lists and merging them into a single sorted list. These merge algorithms generally refer to merge algorithms that take in a number of sorted lists greater than two. 2-Way Merges are referred to as binary merges on the other hand and are also utilized in k-way merge algorithms. == 2-Way Merge == A 2-Way Merge, or a binary merge, has been studied extensively due to its key role in Merge sort. An example of such is the classic merge that appears frequently in merge sort examples. The classic merge outputs the data item with the lowest key at each step; given some sorted lists, it produces a sorted list containing all the elements in any of the input lists, and it does so in time proportional to the sum of the lengths of the input lists. There are algorithms that exist that can operate in better than linear times such as the Hwang-Lin Merging Algorithm.〔F.K.Hwang and S. Lin, \A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets", SIAM Journal on Computing 1 (1972), 31-39.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「K-Way Merge Algorithms」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.